Plücker Embedding of Cyclic Orbit Codes
نویسنده
چکیده
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.
منابع مشابه
Plücker Embedding of Cyclic Orbit Codes
Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words. 1. Introduction. In network coding one is looking at the transmission of information through a directed graph with possibly several senders and several receivers [1]. One c...
متن کاملA complete characterization of irreducible cyclic orbit codes and their Plücker embedding
Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as orbits of a subgroup of the general linear group on the Grassmannian. This paper gives a complete characterization of orbit codes that are generated by an irredu...
متن کاملCyclic Orbit Codes with the Normalizer of a Singer Subgroup
An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...
متن کاملList Decoding of Lifted Gabidulin Codes via the Plücker Embedding
Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of Fq with a given dimension. In this paper, we consider the problem of list decoding of a certain family of codes in the Grassmannian, called lifted Gabidulin codes. For this purpose we use the Plücker embedding of the Grassmannian. We describe a way of represent...
متن کاملGeometric decoding of subspace codes with explicit Schubert calculus applied to spread codes
This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann [17]. The decoding algorithm requires the code to be defined as the intersection of the Plücker embedding of the Grassmannian and an algebraic variety. We call such codes geometric subspace codes. Complexity is substantially...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1205.1823 شماره
صفحات -
تاریخ انتشار 2012